On the Semantics and Automated Deduction for PLFC, a Logic of Possibilistic Uncertainty and Fuzziness
نویسندگان
چکیده
inconsistent Recently a syntactical extension of rst order Possibilistic logic called PLFC dealing with fuzzy constants and fuzzily re stricted quanti ers has been proposed In this paper we present steps towards both the formalization of PLFC itself and an auto mated deduction system for it by i provid ing a formal semantics ii de ning a sound resolution style calculus by refutation and iii describing a rst order proof procedure for PLFC clauses based on ii and on a novel notion of most general substitution of two lit erals in a resolution step
منابع مشابه
Automated Reasoning Using Possibilistic Logic: Semantics, Belief Revision and Variable Certainty Weights
In this paper an approach to automated deduction under uncertainty ,based on possibilistic logic, is proposed ; for that purpose we deal with clauses weighted by a degree which is a lower bound of a necessity or a possibility measure, according to the nature of the uncertainty. Two resolution rules are used for coping with the different situations, and the refutation method can be generalized. ...
متن کاملPossibilistic Residuated Implication Logics with Applications
In this paper, we will develop a class of logics for reasoning about qualitative and quantitative uncertainty. The semantics of the logics is uniformly based on possibility theory. Each logic in the class is parameterized by a t-norm operation on [0,1], and we express the degree of implication between the possibilities of two formulas explicitly by using residuated implication with respect to t...
متن کاملA Logic of Graded Possibility and Certainty Coping with Partial Inconsistency
A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The proposed semantics is based on fuzzy sets of interpretations. It is tolerant to partial inconsistency. Satisfiability is extended from interpretations to fuzz...
متن کاملPossibilistic Nested Logic Programs
We introduce the class of possibilistic nested logic programs. These possibilistic logic programs allow us to use nested expressions in the bodies and the heads of their rules. By considering a possibilistic nested logic program as a possibilistic theory, a construction of a possibilistic logic programing semantics based on answer sets for nested logic programs and the proof theory of possibili...
متن کاملPossibilistic Safe Beliefs vs. Possibilistic Stable Models
In any learning process, the learners arrive with a great deal of variables, such as their different learning styles, their affective states and their previous knowledge, among many others. In most cases, their previous knowledge is incomplete or it comes with a certain degree of uncertainty. Possibilistic Logic was developed as an approach to automated reasoning from uncertain or prioritized i...
متن کامل